Generalised Polygons Admitting a Point-Primitive Almost Simple Group of Suzuki or Ree Type
نویسندگان
چکیده
Let G be a collineation group of a thick finite generalised hexagon or generalised octagon Γ. If G acts primitively on the points of Γ, then a recent result of Bamberg et al. shows that G must be an almost simple group of Lie type. We show that, furthermore, the minimal normal subgroup S of G cannot be a Suzuki group or a Ree group of type G2, and that if S is a Ree group of type F4, then Γ is (up to point–line duality) the classical Ree–Tits generalised octagon.
منابع مشابه
The locally 2-arc transitive graphs admitting an almost simple group of Suzuki type
A graph Γ is said to be locally (G, 2)-arc transitive for G a subgroup of Aut(Γ) if, for any vertex α of Γ, G is transitive on the 2-arcs of Γ starting at α. In this talk, we will discuss general results involving locally (G, 2)-arc transitive graphs and recent progress toward the classification of the locally (G, 2)-arc transitive graphs, where Sz(q) ≤ G ≤ Aut(Sz(q)), q = 2 for some k ∈ N. In ...
متن کاملBiplanes with flag-transitive automorphism groups of almost simple type, with alternating or sporadic socle
In this paper we prove that there cannot be a biplane admitting a primitive, flagtransitive automorphism group of almost simple type, with alternating or sporadic socle.
متن کاملFlag-transitive point-primitive $(v,k,4)$ symmetric designs with exceptional socle of Lie type
Let $G$ be an automorphism group of a $2$-$(v,k,4)$ symmetric design $mathcal D$. In this paper, we prove that if $G$ is flag-transitive point-primitive, then the socle of $G$ cannot be an exceptional group of Lie type.
متن کاملFlag-transitive Point-primitive symmetric designs and three dimensional projective special linear groups
The main aim of this article is to study (v,k,λ)-symmetric designs admitting a flag-transitive and point-primitive automorphism group G whose socle is PSL(3,q). We indeed show that the only possible design satisfying these conditions is a Desarguesian projective plane PG(2,q) and G > PSL(3,q).
متن کاملA Fast Algorithm for Covering Rectangular Orthogonal Polygons with a Minimum Number of r-Stars
Introduction This paper presents an algorithm for covering orthogonal polygons with minimal number of guards. This idea examines the minimum number of guards for orthogonal simple polygons (without holes) for all scenarios and can also find a rectangular area for each guards. We consider the problem of covering orthogonal polygons with a minimum number of r-stars. In each orthogonal polygon P,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 23 شماره
صفحات -
تاریخ انتشار 2016